منابع مشابه
Unchecked Exceptions: Can the Programmer be Trusted to Document Exceptions?
The emergence of exception handling mechanisms in modern programming languages made available a different way of communicating errors between procedures. For years, programmers trusted in the correct documentation for error codes returned by procedures to correctly handle erroneous situations. Now, they have to focus on the documentation of exceptions for the same effect. But to which extent ca...
متن کاملA generalization of the Second Incompleteness Theorem and some exceptions to it
This paper will introduce the notion of a naming convention and use this paradigm to both develop a new version of the Second Incompleteness Theorem and to describe when an axiom system can partially evade the Second Incompleteness Theorem.
متن کاملOn the Results of a 14-Year Effort to Generalize Gödel’s Second Incompleteness Theorem and Explore Its Partial Exceptions
The Second Incompleteness Theorem states that axiom systems of sufficient strength are unable to verify their own consistency. Part of the reason that Gödel's theorem has fascinated logicians is that it almost defies common sense. This is because when human beings cogitate, they implicitly presume that thinking is a useful process. However, this tacit assumption would initially appear to presum...
متن کاملInstitutional Exceptions on Global Projects
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation. 2 This research has benefited significantly from the inputs of scholars associated with the Ronald Coase Institute. 2 " When you hear hoofbeats, think Horses, not Zebras—unless you're in Africa. " This induc...
متن کاملOn Inheritance Hierarchies With Exceptions
Using default logic, we formalize NETL-like inheritance hierarchies with exceptions. This provides a number of benefits: (1) A precise semantics for such hierarchies. (2) A provably correct (with respect to the proof theory of default logic) inference algorithm for acyclic networks. (3) A guarantee that acyclic networks have extensions. (4) A provably correct quasi-parallel inference algorithm ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1987
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-49-1-107-112